21. Quiz: Search Comparison 2

Search Comparison 2

Search Method Optimal? Frontier size Size @ n = 20
Breadth-First Yes \large 2^n 1,048,576
Cheapest-First Yes \large 2^n 1,048,576
Depth-First No \large n 20

Search Comparison 2 Quiz

Which of these searches are complete? Hint: What if one of the paths (whether containing the goal or not) was infinite in length?
SOLUTION:
  • Breadth-First
  • Cheapest-First

Next Concept